A semantic characterization of the well-typed formulæ of λ-calculus
نویسنده
چکیده
A model-theoretic operation is characterised that preserves the property of being a model of typed λ-calculus. (i.e., the result of applying it to a model of typed λ-calculus is another model of typed λ-calculus.) An expression is well-typed iff the class of its models is closed under this operation.
منابع مشابه
Proving Properties of Typed λ-Terms Using Realizability, Covers, and Sheaves
The main purpose of this paper is to take apart the reducibility method in order to understand how its pieces fit together, and in particular, to recast the conditions on candidates of reducibility as sheaf conditions. There has been a feeling among experts on this subject that it should be possible to present the reducibility method using more semantic means, and that a deeper understanding wo...
متن کاملThe safe lambda calculus
Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and generalizing) the safety condition to the setting of the simply-typed lambda calculus. In contrast to the original definition of safety, our c...
متن کاملTowards a Simply Typed CALculus for Semantic Knowledge Bases
This paper demonstrates how a constructive version of the description logic ALC can serve as a semantic type system for an extension of the simply typed λ-calculus to express computations in knowledge bases. This cALculus embodies a functional core language which provides static type checking of semantic information processing of data whose structure is organised under a relational data model a...
متن کاملSoundly Proving B Method Formulæ Using Typed Sequent Calculus
The B Method is a formal method mainly used in the railway industry to specify and develop safety-critical software. To guarantee the consistency of a B project, one decisive challenge is to show correct a large amount of proof obligations, which are mathematical formulæ expressed in a classical set theory extended with a specific type system. To improve automated theorem proving in the B Metho...
متن کاملRealizability, Covers, and Sheaves II. Applications to the Second-Order Lambda-Calculus
We present a general method for proving properties of typed λ-terms. This method is obtained by introducing a semantic notion of realizability which uses the notion of a cover algebra (as in abstract sheaf theory, a cover algebra being a Grothendieck topology in the case of a preorder). For this, we introduce a new class of semantic structures equipped with preorders, called pre-applicative str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007